PRACTICAL RUNGE–KUTTA METHODS FOR SCIENTIFIC COMPUTATION
نویسندگان
چکیده
منابع مشابه
Effective order strong stability preserving RungeKutta methods
We apply the concept of effective order to strong stability preserving (SSP) explicit Runge–Kutta methods. Relative to classical Runge–Kutta methods, effective order methods are designed to satisfy a relaxed set of order conditions, but yield higher order accuracy when composed with special starting and stopping methods. The relaxed order conditions allow for greater freedom in the design of ef...
متن کاملislanding detection methods for microgrids
امروزه استفاده از منابع انرژی پراکنده کاربرد وسیعی یافته است . اگر چه این منابع بسیاری از مشکلات شبکه را حل می کنند اما زیاد شدن آنها مسائل فراوانی برای سیستم قدرت به همراه دارد . استفاده از میکروشبکه راه حلی است که علاوه بر استفاده از مزایای منابع انرژی پراکنده برخی از مشکلات ایجاد شده توسط آنها را نیز منتفی می کند . همچنین میکروشبکه ها کیفیت برق و قابلیت اطمینان تامین انرژی مشترکان را افزایش ...
15 صفحه اولA suggested Motivational Method for Teaching Scientific Terminology, With a Practical Example
Using a reductionist approach, the motivational method for teaching scientific terminology aims at breaking down terms and their definitions into separate components, i.e. morphemes and their semantic features, rather than establishing a connection between terms and their definitions as holistic units. In other words, the ultimate goal of this method is achieving “semantic motivation,” (as oppo...
متن کاملDefects, Scientific Computation and the Scientific Method
Computation has rapidly grown in the last 50 years so that in many scientific areas it is the dominant partner in the practice of science. Unfortunately, unlike the experimental sciences, it does not adhere well to the principles of the scientific method as espoused by for example, the philosopher Karl Popper. Such principles are built around the notions of deniability and reproducibility. Alth...
متن کاملPractical Groebner Basis Computation
We report on our experiences exploring state of the art Gröbner basis computation. We investigate signature based algorithms in detail. We also introduce new practical data structures and computational techniques for use in both signature based Gröbner basis algorithms and more traditional variations of the classic Buchberger algorithm. Our conclusions are based on experiments using our new fre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The ANZIAM Journal
سال: 2009
ISSN: 1446-1811,1446-8735
DOI: 10.1017/s1446181109000030